Duplicate-Insensitive Order Statistics Computation over Data Streams
نویسندگان
چکیده
منابع مشابه
Continuously Maintaining Order Statistics over Data Streams ( Extended
A rank query is essentially to find a data element with a given rank against a monotonic order specified on data elements. It has several equivalent variations [8, 17, 30]. Rank queries over data streams have been investigated in the form of quantile computation. A φ-quantile (φ ∈ (0, 1]) of a collection of N data elements is the element with rank dφNe against a monotonic order specified on dat...
متن کاملAggregate Computation over Data Streams
Nowadays, we have witnessed the widely recognized phenomenon of high speed data streams. Various statistics computation over data streams is often required by many applications, including processing of relational type queries, data mining and high speed network management. In this paper, we provide survey for three important kinds of aggregate computations over data streams: frequency moment, f...
متن کاملComputation of Seasonal Statistics from Annual Data for Iran's Economy
This article has no abstract.
متن کاملRange Efficient Computation of F0 over Massive Data Streams
Efficient one-pass computation of F0, the number of distinct elements in a data stream, is a fundamental problem arising in various contexts in databases and networking. We consider the problem of efficiently estimating F0 of a data stream where each element of the stream is an interval of integers. We present a randomized algorithm which gives an ( , δ) approximation of F0, with the following ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Knowledge and Data Engineering
سال: 2010
ISSN: 1041-4347
DOI: 10.1109/tkde.2009.68